Minimizing Cumulative

نویسندگان

  • Yan Qu
  • Barbara Di Eugenio
  • Alon Lavie
  • Lori Levin
چکیده

Cumulative error limits the usefulness of context in applications utilizing contextual information. It is especially a problem in spontaneous speech systems where unexpected input, out-of-domain utterances and missing information are hard to t into the standard structure of the contextual model. In this paper we discuss how our approaches to recognizing speech acts address the problem of cumulative error. We demonstrate the advantage of the proposed approaches over those that do not address the problem of cumulative error. The experiments are conducted in the context of Enthusiast, a large Spanish-to-English speech-to-speech translation system in the appointment scheduling domain 10, 5, 11]. 1 The Cumulative Error Problem To interpret natural language, it is necessary to take context into account. However , taking context into account can also generate new problems, such as those arising because of cumulative error. Cumulative error is introduced when an incorrect hypothesis is chosen and incorporated into the context, thus providing an inaccurate context from which subsequent context-based predictions are made. For example, in Enthusiast, a large Spanish-to-English speech-to-speech translation system in the appointment scheduling domain 10, 5, 11], we model the discourse context using speech acts to represent the functions of dialogue utterances. Speech act selection is strongly related to the task of determining how the current input utterance relates to the discourse context. When, for instance , a plan-based discourse processor is used to recognize speech acts, the discourse processor computes a chain of inferences for the current input utterance , and attaches it to the current plan tree. The location of the attachment determines which speech act is assigned to the input utterance. Typically an input utterance can be associated with more than one inference chain, representing diierent possible speech acts which could be performed by the utterance out of context. Focusing heuristics are used to rank the diierent inference chains and choose the one which attaches most coherently to the discourse context 3, 8]. However, since heuristics can make wrong predictions, the speech act may be

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robustness and risk-sensitivity in Markov decision processes

We uncover relations between robust MDPs and risk-sensitive MDPs. The objective of a robust MDP is to minimize a function, such as the expectation of cumulative cost, for the worst case when the parameters have uncertainties. The objective of a risk-sensitive MDP is to minimize a risk measure of the cumulative cost when the parameters are known. We show that a risk-sensitive MDP of minimizing t...

متن کامل

Patient dose from CT: a literature review.

CONTEXT Computed tomography (CT) exams are increasingly common and account for a significant portion of individuals' mounting exposure to medical radiation. OBJECTIVE To explore issues surrounding patient radiation dose, including techniques for minimizing dose and the feasibility of tracking lifetime exposure to medical radiation from CT and other imaging exams. METHODS The authors conduct...

متن کامل

Risk-Aware Algorithms for Adversarial Contextual Bandits

In this work we consider adversarial contextual bandits with risk constraints. At each round, nature prepares a context, a cost for each arm, and additionally a risk for each arm. The learner leverages the context to pull an arm and then receives the corresponding cost and risk associated with the pulled arm. In addition to minimizing the cumulative cost, the learner also needs to satisfy long-...

متن کامل

Minimizing Simple and Cumulative Regret in Monte-Carlo Tree Search

Regret minimization is important in both the Multi-Armed Bandit problem and Monte-Carlo Tree Search (MCTS). Recently, simple regret, i.e., the regret of not recommending the best action, has been proposed as an alternative to cumulative regret in MCTS, i.e., regret accumulated over time. Each type of regret is appropriate in different contexts. Although the majority of MCTS research applies the...

متن کامل

Computing von Kries Illuminant Changes by Piecewise Inversion of Cumulative Color Histograms

We present a linear algorithm for the computation of the illuminant change occurring between two color pictures of a scene. We model the light variations with the von Kries diagonal transform and we estimate it by minimizing a dissimilarity measure between the piecewise inversions of the cumulative color histograms of the considered images. We also propose a method for illuminant invariant imag...

متن کامل

Safety-Aware Algorithms for Adversarial Contextual Bandit

In this work we study the safe sequential decision making problem under the setting of adversarial contextual bandits with sequential risk constraints. At each round, nature prepares a context, a cost for each arm, and additionally a risk for each arm. The learner leverages the context to pull an arm and receives the corresponding cost and risk associated with the pulled arm. In addition to min...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996